منابع مشابه
Ordered trees, the uplift principle and the Riordan group
For a large class of ordered trees it’s possible to take results at the root and move them to an arbitrary vertex (the mutator) or to a leaf of the tree. This is the uplift principle. If you also sort by height and record the results in matrix form you end up with one or more elements of a group of infinite lower triangular matrices called the Riordan group. The main tools used are generating f...
متن کاملReal-World Uplift Modelling with Significance-Based Uplift Trees
This paper seeks to document the current state of the art in ‘uplift modelling’—the practice of modelling the change in behaviour that results directly from a specified treatment such as a marketing intervention. We include details of the SignificanceBased Uplift Trees that have formed the core of the only packaged uplift modelling software currently available. The paper includes a summary of s...
متن کاملPDL for Ordered Trees
This paper is about a special version of PDL, designed by Marcus Kracht for reasoning about sibling ordered trees. It has four basic programs corresponding to the child, parent, leftand right-sibling relations in such trees. The original motivation for this language is rooted in the field of model-theoretic syntax. Motivated by recent developments in the area of semistructured data, and, especi...
متن کاملThe wreath product principle for ordered semigroups
Straubing’s wreath product principle provides a description of the languages recognized by the wreath product of two monoids. A similar principle for ordered semigroups is given in this paper. Applications to language theory extend standard results of the theory of varieties to positive varieties. They include a characterization of positive locally testable languages and syntactic descriptions ...
متن کاملOn the Average Height of b-Balanced Ordered Trees
An ordered tree with height h is b-balanced if all its leaves have a level l with h − b <= l <= h, where at least one leaf has a level equal to h − b. For large n, we shall compute asymptotic equivalents to the number of all b-balanced ordered trees with n nodes and of all such trees with height h. Furthermore, assuming that all b-balanced ordered trees with n nodes are equally likely, we shall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2012
ISSN: 0893-9659
DOI: 10.1016/j.aml.2011.11.018